Optimal Self-stabilizing Mutual Exclusion on Synchronous Rings
نویسندگان
چکیده
We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the ring n is unknown, we better the service time by a factor of n (performing the best possible complexity for the stabilization time and the memory consumption). When the memory size is known, we present a protocol that is optimal in memory (constant and independant of n), stabilization time, and service time (both are in Θ(n)).
منابع مشابه
Almost Two State Self Stabilizing Synchronous Ring
A self stabilizing distributed system is a network of state machines which, regardless of its initial global state, once started will regain its consistency by itself in a nite number of steps. Two are the main issues in the design of a self-stabilizing system: stabilization time and memory requirements. In this paper we present an almost two state self stabilizing unidirectional system solving...
متن کاملService Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), i...
متن کاملUniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon
This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (d-daemon). The system is stabilized with probability 1 in OðnÞ expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized. # 2002 Elsevier Science (USA)
متن کاملSelf-Stabilizing Mutual Exclusion Using Tokens in Mobile Ad Hoc Network
In this paper, we propose a self-stabilizing mutual exclusion algorithm using tokens for the mobile ad hoc network. Since the liveness condition of mutual exclusion can’t be guaranteed by any algorithm for a mobile ad hoc network with arbitary mobility, we consider a mobile ad hoc network with restricted mobility. Our algorithm is based on the dynamic virtual rings formed by the token circulati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006